Algebras for Combinatorial Search

نویسنده

  • J. Michael Spivey
چکیده

We show how combinatorial search strategies including depth-first, breadth-first and depth-bounded search can be viewed as different implementations of a common algebraic specification that emphasises the compositionality of the strategies. This specification is placed in a categorical setting that combines algebraic specifications and monads. This article appeared in Workshop on Mathematically Structured Functional Programming (Conor McBride and Tarmo Uustalu, eds.), Kuressaare, Estonia, July 2006. Electronic Workshops in Computing, British Computer Society.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search

A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...

متن کامل

A hybrid metaheuristic using fuzzy greedy search operator for combinatorial optimization with specific reference to the travelling salesman problem

We describe a hybrid meta-heuristic algorithm for combinatorial optimization problems with a specific reference to the travelling salesman problem (TSP). The method is a combination of a genetic algorithm (GA) and greedy randomized adaptive search procedure (GRASP). A new adaptive fuzzy a greedy search operator is developed for this hybrid method. Computational experiments using a wide range of...

متن کامل

CLUSTER ALGEBRAS AND CLUSTER CATEGORIES

These are notes from introductory survey lectures given at the Institute for Studies in Theoretical Physics and Mathematics (IPM), Teheran, in 2008 and 2010. We present the definition and the fundamental properties of Fomin-Zelevinsky’s cluster algebras. Then, we introduce quiver representations and show how they can be used to construct cluster variables, which are the canonical generator...

متن کامل

Certain subalgebras of Lipschitz algebras of infinitely differentiable functions and their maximal ideal spaces

We study an interesting class of Banach function algebras of innitely dierentiable functions onperfect, compact plane sets. These algebras were introduced by Honary and Mahyar in 1999, calledLipschitz algebras of innitely dierentiable functions and denoted by Lip(X;M; ), where X is aperfect, compact plane set, M = fMng1n=0 is a sequence of positive numbers such that M0 = 1 and(m+n)!Mm+n ( m!Mm)...

متن کامل

FORM FINDING FOR RECTILINEAR ORTHOGONAL BUILDINGS THROUGH CHARGED SYSTEM SEARCH ALGORITHM

Preliminary layout design of buildings has a substantial effect on the ultimate design of structural components and accordingly influences the construction cost. Exploring structurally efficient forms and shapes during the conceptual design stage of a project can also facilitate the optimum integrated design of buildings. This paper presents an automated method of determining column layout desi...

متن کامل

ذخیره در منابع من

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Funct. Program.

دوره 19  شماره 

صفحات  -

تاریخ انتشار 2006